Christoph Ambühl : rechercher sur Z-Library

Le plus grand référentiel d'articles scientifiques au monde. 70,000,000+ d'articles gratuitement.

Don't use scam websites

Livres
Articles (14)
Les plus populaires
Liste
- Liste
- Tableau

1

On-line scheduling to minimize max flow time: an optimal preemptive algorithm

Christoph Ambühl, Monaldo Mastrolilli

Journal:

Operations Research Letters

Année:

2005

Langue:

english

Fichier:

PDF, 170 KB

english, 2005

2

On the approximability of the range assignment problem on radio networks in presence of selfish agents

Christoph Ambühl, Andrea E.F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri

Journal:

Theoretical Computer Science

Année:

2005

Langue:

english

Fichier:

PDF, 240 KB

english, 2005

3

A new lower bound for the list update problem in the partial cost model

Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel

Journal:

Theoretical Computer Science

Année:

2001

Langue:

english

Fichier:

PDF, 118 KB

english, 2001

4

The Clique Problem in Intersection Graphs of Ellipses and Triangles

Christoph Ambühl, Uli Wagner

Journal:

Theory of Computing Systems

Année:

2005

Langue:

english

Fichier:

PDF, 316 KB

english, 2005

5

Call Control in Rings

Udo Adamy, Christoph Ambuhl, R. Sai Anand, Thomas Erlebach

Journal:

Année:

2007

Langue:

english

Fichier:

PDF, 254 KB

english, 2007

6

Single Machine Precedence Constrained Scheduling Is a

Christoph Ambühl, Monaldo Mastrolilli

Journal:

Année:

2009

Langue:

english

Fichier:

PDF, 441 KB

english, 2009

7

Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut

Ambühl, Christoph, Mastrolilli, Monaldo, Svensson, Ola

Journal:

SIAM Journal on Computing

Année:

2011

Langue:

english

Fichier:

PDF, 848 KB

english, 2011

8

[IEEE 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) - Providence, RI, USA (2007.10.21-2007.10.23)] 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) - Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling

Ambuhl, Christoph, Mas, Monaldo, Svensson, Ola

Année:

2007

Langue:

english

Fichier:

PDF, 363 KB

english, 2007

9

Tree exploration with logarithmic memory

Ambühl, Christoph, Gąsieniec, Leszek, Pelc, Andrzej, Radzik, Tomasz, Zhang, Xiaohui

Journal:

ACM Transactions on Algorithms

Année:

2011

Langue:

english

Fichier:

PDF, 521 KB

english, 2011

10

Optimal lower bounds for projective list update algorithms

Ambühl, Christoph, Gärtner, Bernd, Stengel, Bernhard von

Journal:

ACM Transactions on Algorithms

Année:

2013

Langue:

english

Fichier:

PDF, 179 KB

english, 2013

11

On the Approximability of Single-Machine Scheduling with Precedence Constraints

Ambühl, Christoph, Mastrolilli, Monaldo, Mutsanas, Nikolaus, Svensson, Ola

Journal:

Mathematics of Operations Research

Année:

2011

Langue:

english

Fichier:

PDF, 352 KB

english, 2011

12

[IEEE 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) - Providence, RI, USA (2007.10.21-2007.10.23)] 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) - Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling

Ambuhl, Christoph, Mastrolilli, Monaldo, Svensson, Ola

Année:

2007

Langue:

english

Fichier:

PDF, 363 KB

english, 2007

13

SIGACT News Online Algorithms Column 31

Ambühl, Christoph

Journal:

ACM SIGACT News

Année:

2017

Langue:

english

Fichier:

PDF, 1.02 MB

english, 2017

14

Novel Smartphone Game Improves Physical Activity Behavior in Type 2 Diabetes

Höchsmann, Christoph, Müller, Olivia, Ambühl, Muriel, Klenk, Christopher, Königstein, Karsten, Infanger, Denis, Walz, Steffen P., Schmidt-Trucksäss, Arno

Journal:

American Journal of Preventive Medicine

Année:

2019

Langue:

english

Fichier:

PDF, 613 KB

english, 2019